Collision Detection of Functionally Defined Objects for Constant Time
نویسندگان
چکیده
The problem of collision detection of functionally defined objects based on perturbation functions for constant time is considered. The collision detection algorithm of different complexity during a constant time is discussed. Recursive object space subdivision algorithm is proposed. In the perturbation function representation, collision detection becomes trivial due to the inside/outside property of the functionally defined surface.
منابع مشابه
A Navigation System for Autonomous Robot Operating in Unknown and Dynamic Environment: Escaping Algorithm
In this study, the problem of navigation in dynamic and unknown environment is investigated and a navigation method based on force field approach is suggested. It is assumed that the robot performs navigation in...
متن کاملParallel Collision Detection in Constant Time
We prove that the maximum number of intersecting pairs spheres between two sets of polydisperse sphere packings is linear in the worst case. This observation is the basis for a new collision detection algorithm. Our new approach guarantees a linear worst case running time for arbitrary 3D objects. Additionally, we present a parallelization of our new algorithm that runs in constant time, even i...
متن کاملTowards Time-Critical Collision Detection for Deformable Objects Based on Reduced Models
Topics of physically based modeling of deformable objects and collision detection have been extensively researched. Please refer to [1, 2, 3] for recent surveys. Nowadays, the combination of GPU techniques and multiresolution physical models [4] allows interactive simulations of complex deformable objects with a large number of polygons. To achieve this, the geometry of the object is separated ...
متن کاملRay Casting against General Convex Objects with Application to Continuous Collision Detection
This paper presents a new algorithm for computing the hit point and normal of a ray and a general convex object. The algorithm is loosely based on the the Gilbert-Johnson-Keerthi algorithm for computing the distance between convex objects in the sense that it is applicable to the same family of convex objects and uses the same subalgorithm for computing the closest point of a simplex. Since thi...
متن کاملDetection of collision events on curved trajectories: optical information from invariant rate-of-bearing change.
Previous research (Andersen & Kim, 2001) has shown that a linear trajectory collision event (i.e., a collision between a moving object and an observer) is specified by objects that expand and maintain a constant bearing (the object location remains constant in the visual field). In the present study, we examined the optical information for detecting a collision event when the trajectory was of ...
متن کامل